Distribution of the absolute indicator of random Boolean functions

نویسندگان

  • Florian Caullery
  • François Rodier
چکیده

The absolute indicator is one of the measures used to determine the resistance offered by a Boolean function when used in the design of a symmetric cryptosystem. It was proposed along with the sum of square indicator to evaluate the quality of the diffusion property of block ciphers and hash functions. While the behaviour of the sum of square of random Boolean functions was already known, what remained was the study of the comportment of the absolute indicator of random Boolean functions. As an application, we show that the absolute indicator can distinguish a nonrandom binary sequence from a random one.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction of n-Variable (n ≡ 2 mod 4) Balanced Boolean Functions With Maximum Absolute Value in Autocorrelation Spectra < 2n/2

In this paper we consider the maximum absolute value ∆f in the autocorrelation spectrum (not considering the zero point) of a function f . In even number of variables n, bent functions possess the highest nonlinearity with ∆f = 0. The long standing open question (for two decades) in this area is to obtain a theoretical construction of balanced functions with ∆f < 2 n 2 . So far there are only a...

متن کامل

Additive autocorrelation of some classes of cubic semi-bent Boolean functions

In this paper, we investigate the relation between the autocorrelation of a cubic Boolean function f ∈ Bn at a ∈ F2n and the kernel of the bilinear form associated with Daf , the derivative of f at a. Further, we apply this technique to obtain the tight upper bounds of absolute indicator and sum-of-squares indicator for avalanche characteristics of various classes of highly nonlinear non-bent c...

متن کامل

ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES

Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...

متن کامل

Propagation Models and Fitting Them for the Boolean Random Sets

In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...

متن کامل

A sprouting tree model for random boolean functions

We define a new probability distribution for Boolean functions of k variables. Consider the random Binary Search Tree of size n, and label its internal nodes by connectives and its leaves by variables or their negations. This random process defines a random Boolean expression which represents a random Boolean function. Finally, let n tend to infinity: the asymptotic distribution on Boolean func...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1801.03337  شماره 

صفحات  -

تاریخ انتشار 2018